Approximation of a generalized continuous-state branching process with interaction
نویسندگان
چکیده
منابع مشابه
Height process for super-critical continuous state branching process
We define the height process for super-critical continuous state branching processes with quadratic branching mechanism. It appears as a projective limit of Brownian motions with positive drift reflected at 0 and a > 0 as a goes to infinity. Then we extend the pruning procedure of branching processes to the super-critical case. This give a complete duality picture between pruning and size propo...
متن کاملOn prolific individuals in a supercritical continuous state branching process
The purpose of this note is to point at an analog for continuous state branching process of the description of prolific individuals in a super-critical Galton-Watson process.
متن کاملChanging the branching mechanism of a continuous state branching process using immigration
We construct a continuous state branching process with immigration (CBI) whose immigration depends on the CBI itself and we recover a continuous state branching process (CB). This provides a dual construction of the pruning at nodes of CB introduced by the authors in a previous paper [1]. This construction is a natural way to model neutral mutation. Using exponential formula, we compute the pro...
متن کاملReal options using a Continuous-state Markov Process Approximation
Real Options were firstly formulated using traditional financial option models, however in practice an investor can confront with exotic dynamics. Nowadays, approaches based on simulations have been proposed for solving complex options. This paper proposes an alternative appraisal based on a Continuous-state Markov Process Approximation (CMPA) for multivariate Real Option problems. We discuss t...
متن کاملContinuous-State Reinforcement Learning with Fuzzy Approximation
Reinforcement learning (RL) is a widely used learning paradigm for adaptive agents. There exist several convergent and consistent RL algorithms which have been intensively studied. In their original form, these algorithms require that the environment states and agent actions take values in a relatively small discrete set. Fuzzy representations for approximate, model-free RL have been proposed i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2018
ISSN: 1083-589X
DOI: 10.1214/18-ecp176